TSTP Solution File: CSR149^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR149^2 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:34:42 EDT 2024
% Result : Theorem 0.22s 0.54s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of formulae : 29 ( 5 unt; 8 typ; 0 def)
% Number of atoms : 84 ( 0 equ; 0 cnn)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 209 ( 36 ~; 26 |; 11 &; 131 @)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 26 ( 0 ^ 22 !; 4 ?; 26 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_37,type,
holdsDuring_THFTYPE_IiooI: $i > $o > $o ).
thf(decl_49,type,
lBill_THFTYPE_i: $i ).
thf(decl_60,type,
lMary_THFTYPE_i: $i ).
thf(decl_72,type,
lSue_THFTYPE_i: $i ).
thf(decl_83,type,
lYearFn_THFTYPE_IiiI: $i > $i ).
thf(decl_87,type,
likes_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_93,type,
n2009_THFTYPE_i: $i ).
thf(decl_110,type,
esk1_0: $i ).
thf(ax_022,axiom,
! [X20: $i,X21: $o] :
( ( holdsDuring_THFTYPE_IiooI @ X20 @ ~ X21 )
=> ~ ( holdsDuring_THFTYPE_IiooI @ X20 @ X21 ) ),
file('/export/starexec/sandbox2/tmp/tmp.A431DSBbJc/E---3.1_20915.p',ax_022) ).
thf(con,conjecture,
? [X5: $i,X6: $i] : ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ X6 ) @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X5 ) ),
file('/export/starexec/sandbox2/tmp/tmp.A431DSBbJc/E---3.1_20915.p',con) ).
thf(ax_004,axiom,
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ! [X5: $i] :
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X5 )
=> ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X5 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.A431DSBbJc/E---3.1_20915.p',ax_004) ).
thf(ax_051,axiom,
! [X6: $i] : ( holdsDuring_THFTYPE_IiooI @ X6 @ $true ),
file('/export/starexec/sandbox2/tmp/tmp.A431DSBbJc/E---3.1_20915.p',ax_051) ).
thf(ax_023,axiom,
likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
file('/export/starexec/sandbox2/tmp/tmp.A431DSBbJc/E---3.1_20915.p',ax_023) ).
thf(c_0_5,plain,
! [X20: $i,X21: $o] :
( ( ( X21
| ( holdsDuring_THFTYPE_IiooI @ X20 @ $true ) )
& ( ~ X21
| ( holdsDuring_THFTYPE_IiooI @ X20 @ $false ) ) )
=> ~ ( holdsDuring_THFTYPE_IiooI @ X20 @ X21 ) ),
inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[ax_022])]) ).
thf(c_0_6,negated_conjecture,
~ ? [X5: $i,X6: $i] :
( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X5 )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ X6 ) @ $true ) )
& ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X5 )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ X6 ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).
thf(c_0_7,axiom,
( ( ~ ! [X5: $i] :
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X5 )
=> ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X5 ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ! [X5: $i] :
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X5 )
=> ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X5 ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[ax_004]) ).
thf(c_0_8,plain,
! [X138: $i,X139: $o] :
( ( X139
| ~ X139
| ~ ( holdsDuring_THFTYPE_IiooI @ X138 @ X139 ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ X138 @ $false )
| ~ X139
| ~ ( holdsDuring_THFTYPE_IiooI @ X138 @ X139 ) )
& ( X139
| ~ ( holdsDuring_THFTYPE_IiooI @ X138 @ $true )
| ~ ( holdsDuring_THFTYPE_IiooI @ X138 @ X139 ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ X138 @ $false )
| ~ ( holdsDuring_THFTYPE_IiooI @ X138 @ $true )
| ~ ( holdsDuring_THFTYPE_IiooI @ X138 @ X139 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
thf(c_0_9,plain,
! [X143: $i] : ( holdsDuring_THFTYPE_IiooI @ X143 @ $true ),
inference(variable_rename,[status(thm)],[ax_051]) ).
thf(c_0_10,negated_conjecture,
! [X132: $i,X133: $i] :
( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X132 )
| ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X132 ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ X133 ) @ $false )
| ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X132 ) )
& ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X132 )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ X133 ) @ $true ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ X133 ) @ $false )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ X133 ) @ $true ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
thf(c_0_11,plain,
! [X135: $i] :
( ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ esk1_0 )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ esk1_0 )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X135 )
| ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X135 )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])])]) ).
thf(c_0_12,plain,
! [X1: $i] :
( ~ ( holdsDuring_THFTYPE_IiooI @ X1 @ $true )
| ~ ( holdsDuring_THFTYPE_IiooI @ X1 @ ~ $true ) ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_8])])]) ).
thf(c_0_13,plain,
! [X1: $i] : ( holdsDuring_THFTYPE_IiooI @ X1 @ $true ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i,X2: $i] :
( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ X2 ) @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_15,plain,
! [X1: $i] :
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true )
| ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_16,plain,
! [X1: $i] :
~ ( holdsDuring_THFTYPE_IiooI @ X1 @ ~ $true ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
thf(c_0_17,negated_conjecture,
! [X1: $i] :
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_13])]) ).
thf(c_0_18,plain,
likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
inference(split_conjunct,[status(thm)],[ax_023]) ).
thf(c_0_19,plain,
! [X1: $i] :
~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
thf(c_0_20,plain,
$false,
inference(sr,[status(thm)],[c_0_18,c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : CSR149^2 : TPTP v8.1.2. Released v4.1.0.
% 0.15/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n027.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 15:06:53 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.51 Running higher-order theorem proving
% 0.22/0.51 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.A431DSBbJc/E---3.1_20915.p
% 0.22/0.54 # Version: 3.1.0-ho
% 0.22/0.54 # Preprocessing class: HSLSSMSMSSSNHFA.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting new_ho_10 with 1500s (5) cores
% 0.22/0.54 # Starting new_ho_10_cnf2 with 300s (1) cores
% 0.22/0.54 # Starting full_lambda_6 with 300s (1) cores
% 0.22/0.54 # Starting full_lambda_9 with 300s (1) cores
% 0.22/0.54 # full_lambda_9 with pid 20999 completed with status 0
% 0.22/0.54 # Result found by full_lambda_9
% 0.22/0.54 # Preprocessing class: HSLSSMSMSSSNHFA.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting new_ho_10 with 1500s (5) cores
% 0.22/0.54 # Starting new_ho_10_cnf2 with 300s (1) cores
% 0.22/0.54 # Starting full_lambda_6 with 300s (1) cores
% 0.22/0.54 # Starting full_lambda_9 with 300s (1) cores
% 0.22/0.54 # SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 0.22/0.54 # Search class: HGHSF-FFMM21-SHFFFFBN
% 0.22/0.54 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.54 # Starting new_ho_10 with 163s (1) cores
% 0.22/0.54 # new_ho_10 with pid 21000 completed with status 0
% 0.22/0.54 # Result found by new_ho_10
% 0.22/0.54 # Preprocessing class: HSLSSMSMSSSNHFA.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting new_ho_10 with 1500s (5) cores
% 0.22/0.54 # Starting new_ho_10_cnf2 with 300s (1) cores
% 0.22/0.54 # Starting full_lambda_6 with 300s (1) cores
% 0.22/0.54 # Starting full_lambda_9 with 300s (1) cores
% 0.22/0.54 # SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 0.22/0.54 # Search class: HGHSF-FFMM21-SHFFFFBN
% 0.22/0.54 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.54 # Starting new_ho_10 with 163s (1) cores
% 0.22/0.54 # Preprocessing time : 0.003 s
% 0.22/0.54 # Presaturation interreduction done
% 0.22/0.54
% 0.22/0.54 # Proof found!
% 0.22/0.54 # SZS status Theorem
% 0.22/0.54 # SZS output start CNFRefutation
% See solution above
% 0.22/0.54 # Parsed axioms : 281
% 0.22/0.54 # Removed by relevancy pruning/SinE : 148
% 0.22/0.54 # Initial clauses : 150
% 0.22/0.54 # Removed in clause preprocessing : 6
% 0.22/0.54 # Initial clauses in saturation : 144
% 0.22/0.54 # Processed clauses : 90
% 0.22/0.54 # ...of these trivial : 4
% 0.22/0.54 # ...subsumed : 4
% 0.22/0.54 # ...remaining for further processing : 82
% 0.22/0.54 # Other redundant clauses eliminated : 0
% 0.22/0.54 # Clauses deleted for lack of memory : 0
% 0.22/0.54 # Backward-subsumed : 0
% 0.22/0.54 # Backward-rewritten : 0
% 0.22/0.54 # Generated clauses : 1
% 0.22/0.54 # ...of the previous two non-redundant : 0
% 0.22/0.54 # ...aggressively subsumed : 0
% 0.22/0.54 # Contextual simplify-reflections : 0
% 0.22/0.54 # Paramodulations : 0
% 0.22/0.54 # Factorizations : 0
% 0.22/0.54 # NegExts : 0
% 0.22/0.54 # Equation resolutions : 0
% 0.22/0.54 # Disequality decompositions : 0
% 0.22/0.54 # Total rewrite steps : 9
% 0.22/0.54 # ...of those cached : 5
% 0.22/0.54 # Propositional unsat checks : 0
% 0.22/0.54 # Propositional check models : 0
% 0.22/0.54 # Propositional check unsatisfiable : 0
% 0.22/0.54 # Propositional clauses : 0
% 0.22/0.54 # Propositional clauses after purity: 0
% 0.22/0.54 # Propositional unsat core size : 0
% 0.22/0.54 # Propositional preprocessing time : 0.000
% 0.22/0.54 # Propositional encoding time : 0.000
% 0.22/0.54 # Propositional solver time : 0.000
% 0.22/0.54 # Success case prop preproc time : 0.000
% 0.22/0.54 # Success case prop encoding time : 0.000
% 0.22/0.54 # Success case prop solver time : 0.000
% 0.22/0.54 # Current number of processed clauses : 81
% 0.22/0.54 # Positive orientable unit clauses : 74
% 0.22/0.54 # Positive unorientable unit clauses: 0
% 0.22/0.54 # Negative unit clauses : 3
% 0.22/0.54 # Non-unit-clauses : 4
% 0.22/0.54 # Current number of unprocessed clauses: 54
% 0.22/0.54 # ...number of literals in the above : 110
% 0.22/0.54 # Current number of archived formulas : 0
% 0.22/0.54 # Current number of archived clauses : 1
% 0.22/0.54 # Clause-clause subsumption calls (NU) : 9
% 0.22/0.54 # Rec. Clause-clause subsumption calls : 7
% 0.22/0.54 # Non-unit clause-clause subsumptions : 0
% 0.22/0.54 # Unit Clause-clause subsumption calls : 7
% 0.22/0.54 # Rewrite failures with RHS unbound : 0
% 0.22/0.54 # BW rewrite match attempts : 0
% 0.22/0.54 # BW rewrite match successes : 0
% 0.22/0.54 # Condensation attempts : 90
% 0.22/0.54 # Condensation successes : 1
% 0.22/0.54 # Termbank termtop insertions : 7169
% 0.22/0.54 # Search garbage collected termcells : 1393
% 0.22/0.54
% 0.22/0.54 # -------------------------------------------------
% 0.22/0.54 # User time : 0.012 s
% 0.22/0.54 # System time : 0.002 s
% 0.22/0.54 # Total time : 0.014 s
% 0.22/0.54 # Maximum resident set size: 2376 pages
% 0.22/0.54
% 0.22/0.54 # -------------------------------------------------
% 0.22/0.54 # User time : 0.018 s
% 0.22/0.54 # System time : 0.004 s
% 0.22/0.54 # Total time : 0.022 s
% 0.22/0.54 # Maximum resident set size: 1924 pages
% 0.22/0.54 % E---3.1 exiting
% 0.22/0.54 % E exiting
%------------------------------------------------------------------------------